Technical Report Department of Computer Science and Engineering University of Minnesota 4 - 192
نویسندگان
چکیده
The fundamental requirement of censorship resistance is content availability and discoverability — it should be easy for users to find and access documents. At the same time, participating storage providers should be unaware of what they are storing to preserve plausible deniability. Fulfilling these requirements simultaneously seems impossible — how does a system maintain a searchable index of content for users and yet hide it from storage providers? These paradoxical requirements have been previously reconciled by requiring out-of-band communication to either find ways to connect to the system, locate files, or learn file decryption keys — an unacceptable situation when easy content discovery is critical. This paper describes a design for a peer-to-peer, permanent, and unblockable content store which is easily searchable and yet self-contained, i.e. does not require out-of-band communication. To achieve this, we separate file data, metadata, and encryption keys such that someone searching for information about a specific topic can retrieve all three components and reconstruct the file, but someone who only stores at most two components can neither determine the nature of the file content nor locate the missing component. We begin by identifying the core requirements for unblockable storage systems to resist state-level Internet censorship, construct a system that fulfills those requirements, and analyze how it avoids the problem of prior attempts at censorship resistance. Finally, we present measurements of a deployed proof-of-concept implementation, demonstrating the feasibility of our design.
منابع مشابه
Department of Computer Science and Engineering University of Minnesota 4 - 192 EECS Building 200 Union Street SE Minneapolis , MN 55455 - 0159 USA TR 04 - 002 Enhancing location service scalability with HIGH - GRADE
ÄÓ BLOCKIN
متن کامل3 Baa - 4 . 2 . 3 . Research Plan
5. Principal Investigator: Shashi Shekhar, Professor, University of Minnesota, Department of Computer Science and Engineering, 4-192 EE/CS Building 200 Union Street SE, Minneapolis, MN 55455, Phone: (612) 625-4012 Fax: (612) 625-0572, Email: [email protected] Alternate contact information. Angie Vail, Grants Management Coordinator, Department of Computer Science and Engineering. Phone:(612) 62...
متن کاملChange Detection Technical Report Department of Computer Science and Engineering University of Minnesota 4 - 192 Keller Hall 200 Union Street SE Minneapolis , MN 55455 - 0159 USA TR 12 - 018 Contextual Time Series Change Detection
Time series data are common in a variety of fields ranging from economics to medicine and manufacturing. As a result, time series analysis and modeling has become an active research area in statistics and data mining. In this paper, we focus on a type of change we call contextual time series change (CTC) and propose a novel two-stage algorithm to address it. In contrast to traditional change de...
متن کاملSensing and Deferral in Planning: Empirical Results
Kurt Krebsbach Computer Science Dept. University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 [email protected] Duane Olawsky Math/CS Dept. Macalester College 228A Olin Hall 1600 Grand Avenue St. Paul, MN 55105 [email protected] Maria Gini Computer Science Dept. University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 gini@cs...
متن کاملMap Cube: A Visualization Tool for Spatial Data Warehouses
(Extended Abstract) S. Shekhar, X. Tan, S. Chawla Computer Science Department, University of Minnesota EE/CS 4-192, 200 Union St. SE., Minneapolis, MN 55455 [shekharjxtan]@cs.umn.edu, [email protected] http://www.cs.umn.edu/research/shashi-group/
متن کاملDepartment of Computer Science and Engineering University of Minnesota 4 - 192 EECS Building 200 Union Street SE Minneapolis , MN 55455 - 0159 USA TR 06 - 001 Architecture Aware Partitioning Algorithms
Existing partitioning algorithms provide limited support for load balancing simulations that are performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes into account the available resources (CPU speed, network bandwidth). With heterogeneous technologies becoming more popul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011